Multi-objective Optimal Motion Planning of Heavy-duty Assembly Robot for Large Spacecraft Entering Cabin
نویسندگان
چکیده
Abstract The space inside the capsule such as station sky and core module is narrow, size of depth large, bearing points are scattered weak, there some difficulties in loading, large size, different shape, complicated interface, position, difficult position pose adjustment, high assembly risk, etc.. To solve these problems, a six-DOF heavy-duty robot proposed this paper. adopts combination linear drive rotating joint to increase working capacity robot. kinematics dynamics analysis model established, path planning carried out by means quintic non-uniform B-spline interpolation method, considering fully constraints assembled equipment, multi-objective trajectory optimization based on NSGA2 algorithm established obtain Pareto optimal solution set with time, impact energy consumption objectives, prove that equipment can be efficient smooth. Reliable installation, less power under analysis.
منابع مشابه
Motion planning for multi-robot assembly systems
This paper addresses a multi-robot optimal assembly planning problem which in essence is an augmented Travelling Salesperson Problem (TSP+). In our TSP+, both the “salesperson” (a robot with a tool) as well as the “cities” (another robot with a workpiece) move. Namely, in addition to the sequencing of tasks, further planning is required to choose where the “salesperson” should rendezvous with e...
متن کاملPareto optimal multi-robot motion planning
This paper studies a class of multi-robot coordina-tion problems where a team of robots aim to reach their goalregions with minimum time and avoid collisions with obstaclesand other robots. A novel numerical algorithm is proposedto identify the Pareto optimal solutions where no robot canunilaterally reduce its traveling time without extending others’.The consistent appro...
متن کاملGeometric Methods for Multi-Robot Optimal Motion Planning
Motion planning for a multi-robotic system refers to finding trajectories for each robot in a team so that a certain task is performed. In general, this problem is under-determined because the tasks are usually specified in terms of reaching a final position starting from a given initial one. Mathematically, this translates to generating interpolating curves with given boundary conditions in a ...
متن کاملMulti-Robot Motion Planning
We present a simple and natural extension of the multi-robot motion planning problem where the robots are partitioned into groups (colors), such that in each group the robots are interchangeable. Every robot is no longer required to move to a specific target, but rather to some target placement that is assigned to its group. We call this problem k-color multi-robot motion planning and provide a...
متن کاملSampling Based Motion Planning for Heavy Duty Autonomous Vehicles
The automotive industry is undergoing a revolution where the more traditional mechanical values are replaced by an ever increasing number of Advanced Driver Assistance Systems (ADAS) where advanced algorithms and software development are taking a bigger role. Increased safety, reduced emissions and the possibility of completely new business models are driving the development and most automotive...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of physics
سال: 2023
ISSN: ['0022-3700', '1747-3721', '0368-3508', '1747-3713']
DOI: https://doi.org/10.1088/1742-6596/2513/1/012007